EM³: A Taxonomy of Heterogeneous Computing Systems

نویسندگان

  • Ilija Ekmecic
  • Igor Tartalja
  • Veljko M. Milutinovic
چکیده

The field of heterogeneous computing is growing rapidly. New concepts and systems appear daily. Hence, it is important to fit each new contribution into its proper place in the puzzle called heterogeneous computing. This is possible only if an adequate taxonomy/classification exists, one that can show whether or not a new system is heterogeneous, and if so, what kind of heterogeneity it exhibits. We propose a new taxonomy that shows the relative position of each and every heterogeneous system in the overall computer systems world. The proposed taxonomy is intended to be both broad enough to encompass all existing heterogeneous systems and simple enough to be easily accepted. Consequently, our taxonomy includes only four classes of computer systems. We propose that computer systems be classified as follows: SESM (single execution mode, single machine model); SEMM (single execution mode, multiple machine models), MESM (multiple execution modes, single machine model), and MEMM (multiple execution modes, multiple machine models)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

A Taxonomy for Describing Matching and Scheduling Heuristics for Mixed-Machine Heterogeneous Computing Systems

The problem of mapping (deened as matching and scheduling) tasks and communications onto multiple machines and networks in a heterogeneous computing (HC) environment has been shown to be NP-complete, in general, requiring the development of heuristic techniques. Many diierent types of mapping heuristics have been developed in recent years. However, selecting the best heuristic to use in any giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Computer

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1995